A linear optimization oracle for zonotope computation

نویسندگان

چکیده

A class of counting problems asks for the number regions a central hyperplane arrangement. By duality, this is same as vertices zonotope. Efficient algorithms are known that solve problem by computing zonotope from its set generators. Here, we give an efficient algorithm, based on linear optimization oracle, performs inverse task and recovers generators vertices. We also provide variation algorithm allows to decide whether polytope, given vertex set, when it not zonotope, compute greatest zonotopal summand.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex programming under a linear optimization oracle The Complexity of Large-scale Convex Programming under a Linear Optimization Oracle

This paper considers a general class of iterative optimization algorithms, referred to as linearoptimization-based convex programming (LCP) methods, for solving large-scale convex programming (CP) problems. The LCP methods, covering the classic conditional gradient (CndG) method (a.k.a., Frank-Wolfe method) as a special case, can only solve a linear optimization subproblem at each iteration. In...

متن کامل

A local linear embedding module for evolutionary computation optimization

A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE employs the stochastic sampling of the data space inherent in Evolutionary Computation in order to reconstruct an approximate mapping from the data space back into the parameter space. This allows to map the target data ...

متن کامل

Computation of Minimum Hamming Weight for Linear Codes

In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$  which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...

متن کامل

Decision Theory Meets Linear Optimization Beyond Computation

The utility function u is then extended to a utility function G(u) on G(A)×Θ by assigning each pair (λ, θ) the expectation of the random variable uθ under the measure λ, i.e. Eλ [ uθ ] . Every pure action a ∈ A then can uniquely be identified with the Dirac-measure δa ∈ G(A) and we have u(a, θ) = G(u)(δa, θ) for all (a, θ) ∈ A × Θ. Further, also (1) can easily be extended to randomized actions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry: Theory and Applications

سال: 2022

ISSN: ['0925-7721', '1879-081X']

DOI: https://doi.org/10.1016/j.comgeo.2021.101809